Algorithms for determining relative star height and star height
نویسندگان
چکیده
منابع مشابه
The Generalized Star-Height Problem
The minimal number of nested Kleene stars required in a regular expression representing a language provides a simple complexity measure on the regular languages. For restricted regular expressions in which complementation is not allowed, much is known about the measure. In particular, Eggan(1963) showed that for any n, there is a language of star-height n[1]. Hashiguchi(1983) then gave a method...
متن کاملDistance Desert Automata and Star Height Substitutions
We introduce the notion of nested distance desert automata as a joint generalization and further development of distance automata and desert automata. We show that limitedness of nested distance desert automata is PSPACE-complete. As an application, we show that it is decidable in 22 O(n2) space whether the language accepted by an n-state non-deterministic automaton is of a star height less tha...
متن کاملThe solution of two star height problems for regular trees
Regular trees can he detined by two types of rational exprwions. For these two types w;isolve the star-height problem, i.e., we show how to construct a rational expression of minimal star-height from the minimal graph of the given tree (i.e., the analogue of the minimal deterministic automaton for regular languages). In one case, the minimal starheight is the rank (in the Sense of Eggan) of the...
متن کاملNonnegative Companion Matrices and Star-Height of N-Rational Series
We prove a new result on N-rational series in one variable. This result gives, under an appropriate hypothesis, a necessary and suucient condition for an N-rational series to be of star-height 1. The proof uses a theorem of Handelman on integral companion matrices.
متن کاملDistance Desert Automata and the Star Height One Problem
We show that it is decidable in time complexity 2 2O(n) whether the language accepted by an n-state non-deterministic automaton is of star height one, which is the first ever complexity result for the star height one problem. To achieve this, we introduce distance desert automata as a joint generalization of distance automata and desert automata, and show the decidability of its limitedness pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1988
ISSN: 0890-5401
DOI: 10.1016/0890-5401(88)90033-8